Petri nets and large finite sets
نویسندگان
چکیده
منابع مشابه
Stubborn Sets for Real-Time Petri Nets
The stubborn-set method attempts to reduce the number of states that must be explicitly enumerated during reachability analysis of a concurrent system, while preserving crucial concurrency properties in the reduced state space. Here we extend the method to the analysis of certain timed models. We also prove that timing properties of interest, such as minimum and maximum delays between events, a...
متن کاملConflict sets in colored Petri nets
Generalizedd StochasticPetriNetsprovidethe modeller withh immediate transitions, but aa model will be correct only if the modeller cann specify how too solve the firingg conflicts betweenn these transitions. This task is usually cumbersome andd may be impossible for large nets. Inn confusion-free nets, these conflict sets are subsets of equivalence classes of aa structural conflict relation, wh...
متن کاملDeriving Petri Nets for Finite Transition Systems
This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a statebased representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that, for any ETS, there exists a Petri Net with minimum transit...
متن کاملFinite Completeness of Categories of Petri Nets
The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. An important class of multiplicative Petri net morphisms is also identified. Th...
متن کاملDeriving Petri Nets from Finite Transition Systems
This paper presents a novel method to derive a Petri net from any specification model that can be mapped into a state-based representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that for any ETS there exists a Petri net with minimum transiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90029-x